//
// Created by Joy on 2024/7/28.
//

#include <bits/stdc++.h>
#define N 15
using namespace std;

int partition(int a[],int n){
    int i = 0;int j = n - 1;
    while (i < j){
        while (i < j && a[j] >= a[0]) j--;
        while (i < j && a[i] <= a[0]) i++;
        swap(a[i],a[j]);
    }
    swap(a[0],a[i]);
    return i;
}

void quickSort(int a[],int left,int right){
    if(left >= right){
        return;
    }
    int pivot = partition(a,N);

}

int main() {

}
